A DPLL Algorithm with Literal Renaming Strategy
نویسندگان
چکیده
Restricted on the proof of unsatisfiability of unsatisfiable formulas, a modified DPLL — RSMLS algorithm is presented. The new algorithm has a symmetry rule (Literal renaming ) and three simplified rule ((1,*)-Resolution, Subformula, and Multiple ). As an example, RSMLS algorithm is applied for the proof of unsatisfiability of pigeon-hole formula . We show with respect to RSMLS algorithm that has a refutation tree with at most O(n n n P 1 − n n P 1 − ) nodes.
منابع مشابه
On the complexity of choosing the branching literal in DPLL
The DPLL algorithm, developed by Davis and Putnam [DP60] and by Davis, Logemann, and Loveland [DLL62], is the most popular complete algorithm for the problem of satisfiability of a set of propositional clauses (SAT). While it is outperformed by local search algorithms on satisfiable formulas [SLM92, SKC94], it is still used because local search algorithms can give a definite answer only if the ...
متن کاملA Dynamic Phase Selection Strategy for Satisfiability Solvers
The phase selection is an important of a SAT Solver based on conflict-driven DPLL. This paper presents a new phase selection strategy, in which the weight of each literal is defined as the sum of its impliedliterals static weights. The implied literals of each literal is computed dynamically during the search. Therefore, it is call a dynamic phase selection strategy. In general, computing dynam...
متن کاملFDPLL — A First-Order Davis-Putnam-Logeman-Loveland Procedure
FDPLL is a directly lifted version of the well-known DavisPutnam-Logeman-Loveland (DPLL) procedure. While DPLL is based on a splitting rule for case analysis wrt. ground and complementary literals, FDPLL uses a lifted splitting rule, i.e. the case analysis is made wrt. non-ground and complementary literals now. The motivation for this lifting is to bring together successful first-order techniqu...
متن کاملAdding a New Conflict Based Branching Heuristic in two Evolved DPLL SAT Solvers
The paper is concerned with the computational evaluation of a new branching heuristic, called reverse assignment sequence (RAS), for evolved DPLL Satisfiability solvers. Such heuristic, like several other recent ones, is based on the history of the conflicts obtained during the solution of an instance. A score is associated to each literal. When a conflict occurs, some scores are incremented wi...
متن کاملHard satisfiable formulas for DPLL-type algorithms
Satisfiability is one of the most popular NP-complete problems. There are two main types of algorithms for solving SAT, namely local search (for references see, for example, [3]) and DPLL-type (this type was first described in the work [5] of Davis and Putnam and [4] of Davis, Logemann and Loveland). A lot of effort has been invested in proving ”less-that-2N ” upper bounds for such algorithms. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000